A Canonical Form for Circuit Diagrams
نویسنده
چکیده
A canonical form for circuit diagrams with a designated start state is presented. The form is based upon nite automata minimization and Shannon's canonical form for boolean expressions.
منابع مشابه
Representing Boolean Functions with If-Then-Else DAGs
This article describes the use of binary decision diagrams (BDDs) and if-then-else dags for representing and manipulating Boolean functions. Two-cuts are de ned for binary decision diagrams, and a relationship is exhibited between general if-then-else expressions and the two-cuts of a BDD for the same function. An algorithm for computing all two-cuts of a BDD in O(n 2 ) time is given. A new can...
متن کاملEdge-Shifted Decision Diagrams for Multiple-Valued Logic
Symbolic data structures for multi-valued logics are useful in a number of applications, from model-checking to circuit design and switch-level circuit verification. Such data structures are referred to as decision diagrams, and are typically considered effective if they are small, i.e., common co-factors of a function are shared, and canonical, i.e., given a variable ordering, there is a uniqu...
متن کاملMulti-level Logic Synthesis Based on Kronecker Decision Diagrams and Boolean Ternary Decision Diagrams for Incompletely Speci ed Functions
This paper introduces several new families of decision diagrams for multi output Boolean functions The in troduced by us families include several diagrams known from literature BDDs FDDs as subsets Due to this property our diagrams can provide a more compact representation of functions than either of the two decision diagrams Kronecker Decision Diagrams KDDs with negated edges are based on thre...
متن کاملDetermining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form
A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...
متن کاملCanonical symbolic analysis of large analog circuits withdeterminant decision diagrams
Symbolic analysis has many applications in the design of analog circuits. Existing approaches rely on two forms of symbolic-expression representation: expanded sum-of-product form and arbitrarily nested form. Expanded form suffers the problem that the number of product terms grows exponentially with the size of a circuit. Nested form is neither canonical nor amenable to symbolic manipulation. I...
متن کامل